Solving the correct-pre x property for TAGs

نویسنده

  • Mark-Jan Nederhof
چکیده

We present a new upper bound for the computational complexity of the parsing problem for TAGs, under the constraint that input is read from left to right in a way that errors in the input are observed as soon as possible, which is called the correct-preex property. The former upper bound was O(n 9), which we now improve to O(n 6), which is the same as that of practical parsing algorithms for TAGs without the additional constraint of the correct-preex property. Thereby we show that the correct-preex property does not require signiicant additional costs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Computational Complexity of the Correct-Prefix Property for TAGs

A new upper bound is presented for the computational complexity of the parsing problem for TAGs, under the constraint that input is read from left to right in such a way that errors in the input are observed as soon as possible, which is called the "correct-prefix property." The former upper bound, O(n9), is now improved to O(n6), which is the same as that of practical parsing algorithms for TA...

متن کامل

Chaotic property for non-autonomous iterated function system

In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...

متن کامل

Privacy-Preserving RFID Systems: Model and Constructions

In this paper, we study systems where a reader wants to authenticate and identify legitimate RFID tags. Such system needs thus to be correct (legitimate tags are accepted) and sound (fake tags are rejected). Moreover, an RFID tag in a privacy-preserving system should be anonymous and untraceable, except for the legitimate reader. We here present the first security model for RFID authentication/...

متن کامل

Weak Banach-Saks property in the space of compact operators

For suitable Banach spaces $X$ and $Y$ with Schauder decompositions and‎ ‎a suitable closed subspace $mathcal{M}$ of some compact operator space from $X$ to $Y$‎, ‎it is shown that the strong Banach-Saks-ness of all evaluation‎ ‎operators on ${mathcal M}$ is a sufficient condition for the weak‎ ‎Banach-Saks property of ${mathcal M}$, where for each $xin X$ and $y^*in‎ ‎Y^*$‎, ‎the evaluation op...

متن کامل

A Functional Characterization of the Hurewicz Property

For a Tychonoff space $X$, we denote by $C_p(X)$ the space of all real-valued continuous functions on $X$ with the topology of pointwise convergence.  We study a functional characterization of the covering property of Hurewicz.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997